________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        04.02.2010 22:51:55
Input Data from:  dataset209.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :40
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0695
Average f[i]   :4537,5
Average g[i,j] :2030,26315789474
Total demand   :5550
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 115
> Selected Move:	740	1	-1	2	4500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 740


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 114
> Selected Move:	1020	1	-1	4	9000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1020


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 111
> Selected Move:	1360	1	-1	9	14500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1360


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 99
> Selected Move:	1980	1	-1	18	19000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1980


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 76
> Selected Move:	2430	1	-1	14	23000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2430


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 99
> Selected Move:	2630	3	0	12	24700


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2630


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 104
> Selected Move:	2680	3	4	7	24200


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2680


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 69
> Selected Move:	2700	3	2	32	23700


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0    >new incumb.: 2700


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 97
> Selected Move:	2750	3	12	28	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0    >new incumb.: 2750


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 78
> Selected Move:	2750	4	28	9	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 81
> Selected Move:	2750	3	7	34	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 104
> Selected Move:	2750	4	9	28	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 157
> Selected Move:	2740	3	32	39	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 89
> Selected Move:	2740	3	34	7	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 71
> Selected Move:	2700	3	7	6	25000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 73
> Selected Move:	2710	3	39	32	24500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 76
> Selected Move:	2720	3	6	35	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 125
> Selected Move:	2700	3	35	4	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 110
> Selected Move:	2700	3	4	22	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 112
> Selected Move:	2700	4	28	9	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 135
> Selected Move:	2710	3	22	6	24600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 97
> Selected Move:	2678	3	6	35	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 146
> Selected Move:	2670	3	28	12	23100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 173
> Selected Move:	2700	3	35	5	24100


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 97
> Selected Move:	2700	4	9	5	24500


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 91
> Selected Move:	2700	3	5	7	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 90
> Selected Move:	2700	4	7	9	22600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 119
> Selected Move:	2700	4	9	14	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 80
> Selected Move:	2700	4	14	18	23800


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 93
> Selected Move:	2700	4	18	32	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 85
> Selected Move:	2700	3	7	34	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 116
> Selected Move:	2700	4	32	9	22600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 155
> Selected Move:	2700	4	9	12	23700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 137
> Selected Move:	2700	4	12	14	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 111
> Selected Move:	2700	4	14	18	23800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 130
> Selected Move:	2700	4	18	34	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 139
> Selected Move:	2700	3	34	15	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 87
> Selected Move:	2700	4	15	9	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 121
> Selected Move:	2690	3	32	39	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 96
> Selected Move:	2690	4	9	15	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 102
> Selected Move:	2690	3	15	5	25000


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 84
> Selected Move:	2690	4	5	9	24600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 95
> Selected Move:	2690	3	5	7	23100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 112
> Selected Move:	2709	3	12	28	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 74
> Selected Move:	2709	3	7	34	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 123
> Selected Move:	2690	3	28	12	23100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 130
> Selected Move:	2690	4	9	12	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 114
> Selected Move:	2690	4	12	18	24300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 108
> Selected Move:	2690	4	18	39	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 108
> Selected Move:	2690	3	34	7	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 92
> Selected Move:	2690	4	39	7	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 88
> Selected Move:	2690	4	7	12	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 101
> Selected Move:	2690	4	12	18	24300


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 97
> Selected Move:	2680	3	39	2	24300


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 74
> Selected Move:	2680	4	18	2	24900


> New Y[]: 
	
	 0  3  2  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 62
> Selected Move:	2680	4	2	7	24900


> New Y[]: 
	
	 0  3  1  0  0  0  0  2  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 64
> Selected Move:	2680	4	7	9	23100


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 112
> Selected Move:	2680	3	7	5	24600


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 72
> Selected Move:	2680	4	9	5	25000


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 70
> Selected Move:	2680	3	5	15	25000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  0  1  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 66
> Selected Move:	2680	4	15	9	24600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  2  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 97
> Selected Move:	2680	3	15	34	23100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 155
> Selected Move:	2680	4	9	2	24900


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 109
> Selected Move:	2680	4	2	12	24200


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 123
> Selected Move:	2680	4	12	18	24300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 145
> Selected Move:	2660	4	18	14	25100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 123
> Selected Move:	2670	3	2	39	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 112
> Selected Move:	2671	3	34	7	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 121
> Selected Move:	2661	3	39	2	25100


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 69 #######################


> Neighbours evaluated; 127
> Selected Move:	2640	3	2	36	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 70 #######################


> Neighbours evaluated; 116
> Selected Move:	2640	4	14	7	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 71 #######################


> Neighbours evaluated; 118
> Selected Move:	2650	3	36	4	24900


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 72 #######################


> Neighbours evaluated; 77
> Selected Move:	2650	4	7	4	24000


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 73 #######################


> Neighbours evaluated; 103
> Selected Move:	2650	4	4	9	23100


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 74 #######################


> Neighbours evaluated; 125
> Selected Move:	2684	3	12	28	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 75 #######################


> Neighbours evaluated; 89
> Selected Move:	2700	4	9	28	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 76 #######################


> Neighbours evaluated; 99
> Selected Move:	2700	3	7	34	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 77 #######################


> Neighbours evaluated; 147
> Selected Move:	2690	3	4	36	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 78 #######################


> Neighbours evaluated; 134
> Selected Move:	2690	4	28	9	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 79 #######################


> Neighbours evaluated; 156
> Selected Move:	2690	3	34	7	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 80 #######################


> Neighbours evaluated; 126
> Selected Move:	2690	4	9	28	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 81 #######################


> Neighbours evaluated; 142
> Selected Move:	2660	3	7	32	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 82 #######################


> Neighbours evaluated; 200
> Selected Move:	2660	4	28	9	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 83 #######################


> Neighbours evaluated; 216
> Selected Move:	2688	3	36	4	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 84 #######################


> Neighbours evaluated; 167
> Selected Move:	2688	3	32	34	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 85 #######################


> Neighbours evaluated; 180
> Selected Move:	2650	3	28	12	23100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 86 #######################


> Neighbours evaluated; 177
> Selected Move:	2719	1	-1	32	27100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 87 #######################


> Neighbours evaluated; 193
> Selected Move:	2742	3	4	36	26600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 88 #######################


> Neighbours evaluated; 206
> Selected Move:	2750	3	34	7	26600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 89 #######################


> Neighbours evaluated; 191
> Selected Move:	2730	3	36	4	27100


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 90 #######################


> Neighbours evaluated; 151
> Selected Move:	2704	3	12	3	26600


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 91 #######################


> Neighbours evaluated; 151
> Selected Move:	2714	3	4	36	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 92 #######################


> Neighbours evaluated; 171
> Selected Move:	2708	3	7	34	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 93 #######################


> Neighbours evaluated; 194
> Selected Move:	2680	3	36	4	26600


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 94 #######################


> Neighbours evaluated; 184
> Selected Move:	2667	3	4	29	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 95 #######################


> Neighbours evaluated; 183
> Selected Move:	2662	3	34	7	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 96 #######################


> Neighbours evaluated; 148
> Selected Move:	2646	3	29	12	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 97 #######################


> Neighbours evaluated; 128
> Selected Move:	2641	3	12	22	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 98 #######################


> Neighbours evaluated; 134
> Selected Move:	2635	3	7	6	26100


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 99 #######################


> Neighbours evaluated; 145
> Selected Move:	2630	3	6	34	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 100 #######################


> Neighbours evaluated; 167
> Selected Move:	2630	2	22	-1	22100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 101 #######################


> Neighbours evaluated; 185
> Selected Move:	2630	4	9	3	24500


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 102 #######################


> Neighbours evaluated; 136
> Selected Move:	2630	4	3	14	24100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 103 #######################


> Neighbours evaluated; 158
> Selected Move:	2630	4	14	18	23300


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 104 #######################


> Neighbours evaluated; 169
> Selected Move:	2630	4	18	32	24100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 105 #######################


> Neighbours evaluated; 150
> Selected Move:	2630	4	32	34	24500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 106 #######################


> Neighbours evaluated; 143
> Selected Move:	2630	3	3	4	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 107 #######################


> Neighbours evaluated; 131
> Selected Move:	2650	3	34	12	24200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 108 #######################


> Neighbours evaluated; 155
> Selected Move:	2670	3	4	35	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 109 #######################


> Neighbours evaluated; 172
> Selected Move:	2670	4	12	18	24300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 110 #######################


> Neighbours evaluated; 175
> Selected Move:	2670	4	18	35	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 111 #######################


> Neighbours evaluated; 162
> Selected Move:	2660	3	35	6	24500


> New Y[]: 
	
	 0  3  0  0  0  0  2  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 112 #######################


> Neighbours evaluated; 112
> Selected Move:	2660	4	6	9	22600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 113 #######################


> Neighbours evaluated; 153
> Selected Move:	2660	4	9	12	23700


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 114 #######################


> Neighbours evaluated; 128
> Selected Move:	2672	3	6	5	25200


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 115 #######################


> Neighbours evaluated; 109
> Selected Move:	2673	3	5	15	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 116 #######################


> Neighbours evaluated; 114
> Selected Move:	2661	4	12	18	25300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 117 #######################


> Neighbours evaluated; 122
> Selected Move:	2663	3	15	5	25300


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 118 #######################


> Neighbours evaluated; 121
> Selected Move:	2660	3	5	6	23800


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 119 #######################


> Neighbours evaluated; 134
> Selected Move:	2660	4	18	14	24600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 120 #######################


> Neighbours evaluated; 125
> Selected Move:	2660	4	14	32	24600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 121 #######################


> Neighbours evaluated; 144
> Selected Move:	2660	3	6	35	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 122 #######################


> Neighbours evaluated; 179
> Selected Move:	2659	4	32	14	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 123 #######################


> Neighbours evaluated; 212
> Selected Move:	2650	3	35	22	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  1  0  2  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 124 #######################


> Neighbours evaluated; 159
> Selected Move:	2650	4	14	9	22600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 125 #######################


> Neighbours evaluated; 177
> Selected Move:	2670	1	-1	6	26600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 126 #######################


> Neighbours evaluated; 151
> Selected Move:	2662	3	6	7	26600


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 127 #######################


> Neighbours evaluated; 139
> Selected Move:	2654	3	7	34	26600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 128 #######################


> Neighbours evaluated; 194
> Selected Move:	2646	3	22	3	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 129 #######################


> Neighbours evaluated; 171
> Selected Move:	2608	3	12	23	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 130 #######################


> Neighbours evaluated; 183
> Selected Move:	2600	3	34	7	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 131 #######################


> Neighbours evaluated; 148
> Selected Move:	2630	2	23	-1	22100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 132 #######################


> Neighbours evaluated; 151
> Selected Move:	2630	4	9	3	24500


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 133 #######################


> Neighbours evaluated; 105
> Selected Move:	2630	4	3	7	23900


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 134 #######################


> Neighbours evaluated; 117
> Selected Move:	2630	4	7	14	24100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  1  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 135 #######################


> Neighbours evaluated; 111
> Selected Move:	2630	4	14	18	23300


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 136 #######################


> Neighbours evaluated; 131
> Selected Move:	2630	4	18	32	24100


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 137 #######################


> Neighbours evaluated; 133
> Selected Move:	2630	3	3	4	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 138 #######################


> Neighbours evaluated; 109
> Selected Move:	2650	3	32	12	24200


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 139 #######################


> Neighbours evaluated; 95
> Selected Move:	2650	4	12	18	24300


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 140 #######################


> Neighbours evaluated; 99
> Selected Move:	2650	3	7	32	24300


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 141 #######################


> Neighbours evaluated; 157
> Selected Move:	2650	4	18	4	24000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 142 #######################


> Neighbours evaluated; 154
> Selected Move:	2680	3	14	20	25000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 143 #######################


> Neighbours evaluated; 115
> Selected Move:	2680	4	4	9	24100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 144 #######################


> Neighbours evaluated; 166
> Selected Move:	2670	3	32	39	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 145 #######################


> Neighbours evaluated; 149
> Selected Move:	2660	3	39	2	24600


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 146 #######################


> Neighbours evaluated; 159
> Selected Move:	2650	3	2	30	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 147 #######################


> Neighbours evaluated; 168
> Selected Move:	2650	3	30	35	24600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 148 #######################


> Neighbours evaluated; 168
> Selected Move:	2630	3	12	32	24100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 149 #######################


> Neighbours evaluated; 172
> Selected Move:	2630	4	9	4	25000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 150 #######################


> Neighbours evaluated; 170
> Selected Move:	2630	3	35	30	25000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 151 #######################


> Neighbours evaluated; 152
> Selected Move:	2630	4	4	9	24100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 152 #######################


> Neighbours evaluated; 184
> Selected Move:	2620	4	9	30	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 153 #######################


> Neighbours evaluated; 166
> Selected Move:	2661	3	30	12	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  2  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 154 #######################


> Neighbours evaluated; 158
> Selected Move:	2653	4	12	18	25300


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 155 #######################


> Neighbours evaluated; 163
> Selected Move:	2655	4	18	20	25300


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 173
> Selected Move:	2650	3	20	33	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 160
> Selected Move:	2643	4	33	9	25100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 166
> Selected Move:	2650	3	33	14	23100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 159 #######################


> Neighbours evaluated; 181
> Selected Move:	2732	1	-1	6	27100


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 166
> Selected Move:	2726	3	4	36	26600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 161 #######################


> Neighbours evaluated; 208
> Selected Move:	2708	3	6	22	26600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 162 #######################


> Neighbours evaluated; 221
> Selected Move:	2690	3	36	4	27100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 163 #######################


> Neighbours evaluated; 188
> Selected Move:	2662	3	12	3	26600


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 164 #######################


> Neighbours evaluated; 181
> Selected Move:	2669	3	4	36	26100


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 165 #######################


> Neighbours evaluated; 200
> Selected Move:	2674	3	22	6	26100


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 166 #######################


> Neighbours evaluated; 199
> Selected Move:	2648	3	36	4	26600


> New Y[]: 
	
	 0  3  0  1  1  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 167 #######################


> Neighbours evaluated; 159
> Selected Move:	2633	3	4	29	26100


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 168 #######################


> Neighbours evaluated; 159
> Selected Move:	2622	3	29	12	26600


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 169 #######################


> Neighbours evaluated; 138
> Selected Move:	2617	3	3	35	27100


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 170 #######################


> Neighbours evaluated; 143
> Selected Move:	2606	3	6	7	27100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 171 #######################


> Neighbours evaluated; 152
> Selected Move:	2606	3	35	23	27100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 172 #######################


> Neighbours evaluated; 144
> Selected Move:	2610	2	7	-1	23100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 173 #######################


> Neighbours evaluated; 190
> Selected Move:	2650	3	14	20	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 174 #######################


> Neighbours evaluated; 166
> Selected Move:	2660	3	32	36	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 175 #######################


> Neighbours evaluated; 161
> Selected Move:	2640	3	36	39	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 176 #######################


> Neighbours evaluated; 163
> Selected Move:	2630	3	39	2	24600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 177 #######################


> Neighbours evaluated; 157
> Selected Move:	2630	3	23	36	24100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 178 #######################


> Neighbours evaluated; 141
> Selected Move:	2620	3	2	32	23600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 179 #######################


> Neighbours evaluated; 164
> Selected Move:	2620	4	9	12	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 180 #######################


> Neighbours evaluated; 133
> Selected Move:	2628	3	32	23	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 181 #######################


> Neighbours evaluated; 134
> Selected Move:	2619	3	36	32	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 182 #######################


> Neighbours evaluated; 141
> Selected Move:	2610	3	20	14	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  2  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 183 #######################


> Neighbours evaluated; 175
> Selected Move:	2660	3	12	28	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  2  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 184 #######################


> Neighbours evaluated; 162
> Selected Move:	2660	3	32	7	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 185 #######################


> Neighbours evaluated; 132
> Selected Move:	2660	3	7	34	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 186 #######################


> Neighbours evaluated; 167
> Selected Move:	2650	3	23	35	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 187 #######################


> Neighbours evaluated; 142
> Selected Move:	2660	3	34	36	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 188 #######################


> Neighbours evaluated; 181
> Selected Move:	2650	3	35	6	24500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 189 #######################


> Neighbours evaluated; 144
> Selected Move:	2660	3	36	4	25000


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 190 #######################


> Neighbours evaluated; 146
> Selected Move:	2650	3	4	35	25000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 191 #######################


> Neighbours evaluated; 140
> Selected Move:	2658	3	6	39	25500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 192 #######################


> Neighbours evaluated; 160
> Selected Move:	2690	3	35	22	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 193 #######################


> Neighbours evaluated; 152
> Selected Move:	2681	4	28	9	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 177
> Selected Move:	2691	3	22	6	25100


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 161
> Selected Move:	2659	3	6	35	25600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 205
> Selected Move:	2660	3	28	12	23600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 183
> Selected Move:	2695	1	-1	6	27600


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 183
> Selected Move:	2692	3	35	4	27600


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 161
> Selected Move:	2719	3	6	7	27600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 148
> Selected Move:	2711	3	4	36	27100


> New Y[]: 
	
	 0  3  0  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 201 #######################


> Neighbours evaluated; 162
> Selected Move:	2721	3	39	2	27100


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 202 #######################


> Neighbours evaluated; 160
> Selected Move:	2710	3	7	34	27100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 203 #######################


> Neighbours evaluated; 178
> Selected Move:	2680	3	2	39	27100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 204 #######################


> Neighbours evaluated; 167
> Selected Move:	2654	3	12	3	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 205 #######################


> Neighbours evaluated; 178
> Selected Move:	2646	3	34	7	26600


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 206 #######################


> Neighbours evaluated; 168
> Selected Move:	2620	2	36	-1	22600


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  2  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 207 #######################


> Neighbours evaluated; 156
> Selected Move:	2620	4	9	3	25000


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 208 #######################


> Neighbours evaluated; 107
> Selected Move:	2620	4	3	7	24400


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135
________________________________________________________________

Best solution found: 2750
Run Termination time: 04.02.2010 22:55:25
Run duration: 00:03:29.8281250
________________________________________________________________
